Bounded Choice Queries for Logic Programming
نویسنده
چکیده
Adding I/O to logic programming is an essential task. Unfortunately, none of the existing logic languages can model bounded inputs. Executing the goal read(x)G from a program P simply tries to unify x with the keyboard input. This is an unpredictable and unguided situation, because the user can type in anything. We propose to modify the operational semantics above to allow for more controlled and more guided participation from the user. We illustrate our idea via Prolog , an extension of Prolog with bounded inputs. keywords: input, logic programming, bounded input, read.
منابع مشابه
Towards a Decidable LogicWeb via Length-Bounded Derivations
LogicWeb has traditionally lacked devices for dealing with intractable queries. We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form pv(P, G, n) which is a success if a query G can be proved from the web page P within n proof steps. It thus makes LogicWeb decidable and more tractable. During the process, we p...
متن کاملEfficient homomorphism-free enumeration of conjunctive queries
Many algorithms in the field of inductive logic programming rely on a refinement operator satisfying certain desirable properties. Unfortunately, for the space of conjunctive queries under θ-subsumption, no optimal refinement operator exists. In this paper, we argue that this does not imply that frequent pattern mining in this setting can not be efficient. As an example, we consider the problem...
متن کاملA Terminating Evaluation of Logic Programs with Finite Three-Valued Models
As evaluation methods for logic programs have become more sophisticated, the classes of programs for which termination can be guaranteed have expanded. From the perspective of answer set programs that include function symbols, recent work has identified classes for which grounding routines can terminate either on the entire program [Calimeri et al. 2008] or on suitable queries [Baselice et al. ...
متن کاملQuerying Disjunctive Database Through Nonmonotonic Logics
Query languages for retrieving information from disjunctive databases are an interesting open area of research. In this paper we study the expressive power of major non-monotonic formalisms { such as circumscription, default logic, autoepis-temic logic and some logic programming languages { used as query languages over disjunctive databases. For this aim, we deene the semantics of query express...
متن کاملDistributional Learning of Regular Formal Graph System of Bounded Degree
In this paper, we describe how distributional learning techniques can be applied to formal graph system (FGS) languages. Formal graph system is a logic program that deals with term graphs instead of the terms of first-order predicate logic. We show that the FGS languages of bounded degree with the 1-finite context property (1-FCP) and the bounded treewidth property can be learned from positive ...
متن کامل